Some problems in distributed computational geometry
نویسندگان
چکیده
منابع مشابه
Some Problems in Distributed Computational Geometry
A geometric network is a distributed network where each processor is identified by two numbers, representing the coordinates of the point in the plane where the processor is located. The edges of the network correspond to straight line segments such that no two of them intersect. In this paper we introduce the study of distributed computing in geometric networks. We study several computational ...
متن کاملSome Dynamic Computational Geometry Problems
\‘c consider some problems in computattonal geometry when every one of the input points i\ movmg in a prescribed manner.
متن کاملOn the Computational Complexity of some problems from Combinatorial Geometry
We study several canonical decision problems that arise from the most famous theorems from combinatorial geometry. We show that these are W[1]-hard (and NP-hard) if the dimension is part of the input by fpt-reductions (which are actually ptime-reductions) from the d-Sum problem. Among others, we show that computing the minimum size of a Caratheodory set and a Helly set and certain decision vers...
متن کاملComputational Geometry Problems in REDLOG
We solve algorithmic geometrical problems in real 3-space or the real plane arising from applications in the area of cad, computer vision, and motion planning. The problems include parallel and central projection problems, shade and cast shadow problems, reconstruction of objects from images, oosets of objects, Voronoi diagrams of a nite families of objects, and collision of moving objects. Our...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2011
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2011.06.035